Qubit purification speed-up for three complementary continuous measurements
نویسندگان
چکیده
منابع مشابه
Qubit purification speed-up for three complementary continuous measurements.
We consider qubit purification under simultaneous continuous measurement of the three non-commuting qubit operators σ(x), σ(y), σ(z). The purification dynamics is quantified by (i) the average purification rate and (ii) the mean time of reaching a given level of purity, 1-ε. Under ideal measurements (detector efficiency η=1), we show in the first case an asymptotic mean purification speed-up of...
متن کاملQubit state monitoring by measurement of three complementary observables.
We consider the evolution of a qubit (spin 1/2) under the simultaneous continuous measurement of three noncommuting qubit operators σ(x), σ(y), and σ(z). For identical ideal detectors, the qubit state evolves by approaching a pure state with a random direction in the Bloch vector space and by undergoing locally isotropic diffusion in the perpendicular directions. The quantum state conditioned o...
متن کاملUniversal quantum computation with two- and three-qubit projective measurements
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0〉 state, suffice for universal quantum computation. This extends work of Nielsen [Nie01], who proposed a scheme in which an arbitrary unitary operation on n qubits can be simulated using only projective measurements on at most 2n qubits. All measurements in our set involve two qubits, ...
متن کاملPurification of Logic-Qubit Entanglement
Recently, the logic-qubit entanglement shows its potential application in future quantum communication and quantum network. However, the entanglement will suffer from the noise and decoherence. In this paper, we will investigate the first entanglement purification protocol for logic-qubit entanglement. We show that both the bit-flip error and phase-flip error in logic-qubit entanglement can be ...
متن کاملQubit Complexity of Continuous Problems
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2012
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2011.0516